Simultaneous Colorings of Plane Graphs (In Chinese)

Abstract: Given a plane graph G = (V, E, F), we can define the vertex coloring for V, the edge coloring for E, the face coloring for F, the total coloring for V∪E, the coupled coloring for V∪F, the edge-face coloring for E∪F, and the entire coloring V∪E∪F, such that adjacent or incident elements have different colors. In this talk we shall give a survey on these colorings and list colorings of plane graphs. Some recent results and open problems about this direction are mentioned.

Chinesecombinatorics

Audience: researchers in the topic

Comments: password 121323

SCMS Combinatorics Seminar

Series comments: Check scmscomb.github.io/ for more information